//#define _CRT_SECURE_NO_WARNINGS
//#include <iostream>
//
//using namespace std;
//typedef long long LL;
//const int N = 1e5 + 10;
//LL n, m, p;
//LL f[N], g[N];
//LL qpow(LL a, LL b, LL p)
//{
//	LL ret = 1;
//	while (b)
//	{
//		if (b & 1) ret = ret * a % p;
//		a = a * a % p;
//		b >>= 1;
//	}
//	return ret;
//}
//void init()
//{
//	int n = p - 1;
//	f[0] = 1;
//	for (int i = 1; i <= n; i++)
//	{
//		f[i] = f[i - 1] * i % p;
//	}
//	g[n] = qpow(f[n], p - 2, p);
//	for (int i = n - 1; i >= 0; i--)
//	{
//		g[i] = ((i + 1) * g[i + 1]) % p;
//	}
//}
//LL C(int n, int m, LL p)
//{
//	if (n < m) return 0;
//	return f[n] * g[m] % p * g[n - m] % p;
//}
//LL lucas(LL n, LL m, LL p)
//{
//	if (m == 0) return 1;
//	return lucas(n / p, m / p, p) * C(n % p, m % p, p) % p;
//}
//int main()
//{
//
//	return 0;
//}
#include<iostream>
using namespace std;
typedef long long LL;

const int N = 1e5 + 10;
LL f[N];
LL g[N];
LL n, m, p;
LL qpow(LL a, LL b, LL p)
{
	LL ret = 1;
	while (b)
	{
		if (b & 1) ret = ret * a % p;
		a = a * a % p;
		b >>= 1;

	}
	return ret;
}
void init()
{
	LL n = p - 1;
	f[0] = 1;
	for (int i = 1; i <= n; i++) f[i] = f[i - 1] * i % p;
	g[n] = qpow(f[n], p - 2, p);
	for (int i = n - 1; i >= 0; i--)
		g[i] = g[i + 1] * (i + 1) % p;
}

LL C(LL n, LL m, LL p)
{
	if (n < m) return 0;
	return f[n] * g[n - m] % p * g[m] % p;
} 
LL lucus(LL n, LL m ,LL p)
{
	if (m == 0) return 1;

	return lucus(n / p, m / p, p) * C(n % p, m % p, p) % p;
}
int main()
{
	int t; cin >> t;
	while (t--)
	{
		cin >> n >> m >> p;
		init();
		cout << lucus(n + m, m, p) << endl;
	}

	return 0;
}